semi-Eulerian graph

Игры ⚽ Поможем написать реферат

Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the … Wikipedia
Clebsch graph — Named after Alfred Clebsch Vertices 16 Edges 40 … Wikipedia

Словари и энциклопедии на Академике